Automatic transformation of iterative loops into recursive methods
نویسندگان
چکیده
منابع مشابه
Automatic transformation of iterative loops into recursive methods
Context: In software engineering, taking a good election between recursion and iteration is essential because their efficiency and maintenance are different. In fact, developers often need to transform iteration into recursion (e.g., in debugging, to decompose the call graph into iterations); thus, it is quite surprising that there does not exist a public transformation from loops to recursion ...
متن کاملTransforming while/do/for/foreach-Loops into Recursive Methods
In software engineering, taking a good election between recursion and iteration is essential because their efficiency and maintenance are different. In fact, developers often need to transform iteration into recursion (e.g., in debugging, to decompose the call graph into iterations); thus, it is quite surprising that there does not exist a public transformation from loops to recursion that hand...
متن کاملEqualization of Doubly Selective Channels Using Iterative and Recursive Methods
All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. 2 DECLARATION This work has not previously been accepted in substance f...
متن کاملAutomatic Transformation of linear Text into Hypertext
Technical products are often shipped with voluminous documentations. As to complex software products, machine-readable manuals are provided in most cases in addition to the printed version of a documentation. Although electronically stored text has many advantages in contrast to the traditional medium “paper”, the question arises how to manage the text of an online documentation. If the fact is...
متن کاملSynthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs
An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a non-recursive iterative program. By augmenting a relational system with this algorithm, least fixed point queries can be handled automatically, and there is no need to proceduralizc relational algebra for such queries.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Software Technology
سال: 2015
ISSN: 0950-5849
DOI: 10.1016/j.infsof.2014.10.001